By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 32, Issue 5, pp. 1115-1394

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

A Polynomial-Time Algorithm for Near-Perfect Phylogeny

David Fernández-Baca and Jens Lagergren

pp. 1115-1127

BibTeX  Abstract Full Text:  PDF

The 3-Colorability Problem on Graphs with Maximum Degree Four

Martin Kochol, Vadim Lozin, and Bert Randerath

pp. 1128-1139

BibTeX  Abstract Full Text:  PDF

Algorithms for Boolean Function Query Properties

Scott Aaronson

pp. 1140-1157

BibTeX  Abstract Full Text:  PDF

On Testing Convexity and Submodularity

Michal Parnas, Dana Ron, and Ronitt Rubinfeld

pp. 1158-1184

BibTeX  Abstract Full Text:  PDF

Lower Bounds for Matrix Product

Amir Shpilka

pp. 1185-1200

BibTeX  Abstract Full Text:  PDF

Searching for Sorted Sequences of Kings in Tournaments

Jian Shen, Li Sheng, and Jie Wu

pp. 1201-1209

BibTeX  Abstract Full Text:  PDF

An Optimal Algorithm for Checking Regularity

Y. Kohayakawa, V. Rödl, and L. Thoma

pp. 1210-1235

BibTeX  Abstract Full Text:  PDF

Dimension in Complexity Classes

Jack H. Lutz

pp. 1236-1259

BibTeX  Abstract Full Text:  PDF

The Natural Work-Stealing Algorithm is Stable

Petra Berenbrink, Tom Friedetzky, and Leslie Ann Goldberg

pp. 1260-1279

BibTeX  Abstract Full Text:  PDF

The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms

Markus Püschel and José M. F. Moura

pp. 1280-1316

BibTeX  Abstract Full Text:  PDF

Approximation Schemes for Minimum Latency Problems

Sanjeev Arora and George Karakostas

pp. 1317-1337

BibTeX  Abstract Full Text:  PDF

Reachability and Distance Queries via 2-Hop Labels

Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick

pp. 1338-1355

BibTeX  Abstract Full Text:  PDF

On the Complexity of Matrix Product

Ran Raz

pp. 1356-1369

BibTeX  Abstract Full Text:  PDF

Minimizing Total Completion Time on Parallel Machines with Deadline Constraints

Joseph Y. T. Leung and Michael Pinedo

pp. 1370-1388

BibTeX  Abstract Full Text:  PDF

Kolmogorov Complexity and Deterministic Context-Free Languages

Oliver Glier

pp. 1389-1394

BibTeX  Abstract Full Text:  PDF